H2-Matrix Approximation of Integral Operators by Interpolation
نویسندگان
چکیده
Typical panel clustering methods for the fast evaluation of integral operators are based on the Taylor expansion of the kernel function and therefore usually require the user to implement the evaluation of the derivatives of this function up to an arbitrary degree. We propose an alternative approach that replaces the Taylor expansion by simple polynomial interpolation. By applying the interpolation idea to the approximating polynomials on different levels of the cluster tree, the matrix vector multiplication can be performed in only O(npd) operations for a polynomial order of p and an n-dimensional trial space. The main advantage of our method, compared to other methods, is its simplicity: Only pointwise evaluations of the kernel and of simple polynomials have to be implemented.
منابع مشابه
Approximation of integral operators by H2-matrices with adaptive bases
H 2-matrices can be used to construct efficient approximations of discretized integral operators. The H 2-matrix approximation can be constructed efficiently by interpolation, Taylor or multipole expansion of the integral kernel function, but the resulting representation requires a large amount of storage. In order to improve the efficiency, local Schur decompositions can be used to eliminate r...
متن کاملApproximation of Integral Operators by Variable-Order Interpolation
We employ a data-sparse, recursive matrix representation, so-called H 2-matrices, for the efficient treatment of discretized integral operators. We obtained this format using local tensor product interpolants of the kernel function and replacing high-order approximations with piecewise lower-order ones. The scheme has optimal, i.e., linear, complexity in the memory requirement and time for the ...
متن کاملHybrid cross approximation of integral operators
The efficient treatment of dense matrices arising, e.g., from the finite element discretisation of integral operators requires special compression techniques. In this article we use the H-matrix representation that approximates the dense stiffness matrix in admissible blocks (corresponding to subdomains where the underlying kernel function is smooth) by low-rank matrices. The low-rank matrices ...
متن کاملApproximation from Shift-invariant Spaces by Integral Operators∗
We investigate approximation from shift-invariant spaces by using certain integral operators and discuss various applications of this approximation scheme. We assume that our integral operators commute with shift operators and that their kernel functions decay at a polynomial rate. We prove that the approximation order provided by such an integral operator is m if and only if the integral opera...
متن کاملRough approximation operators based on quantale-valued fuzzy generalized neighborhood systems
Let $L$ be an integral and commutative quantale. In this paper, by fuzzifying the notion of generalized neighborhood systems, the notion of $L$-fuzzy generalized neighborhoodsystem is introduced and then a pair of lower and upperapproximation operators based on it are defined and discussed. It is proved that these approximation operators include generalized neighborhood system...
متن کامل